Applications of isometric embeddings to chemical graphs
نویسنده
چکیده
Abstract. Applications of isometric embeddings of benzenoid graphs are surveyed. Their embeddings into hypercubes provide methods for computing the Wiener index and the Szeged index, while embeddings into the Cartesian product of trees lead to fast algorithms. A new method for computing the hyperWiener index of partial cubes in general, and of benzenoid graphs and trees in particular, is also presented.
منابع مشابه
Isometric embeddings of Johnson graphs in Grassmann graphs
Let V be an n-dimensional vector space (4 ≤ n < ∞) and let Gk(V ) be the Grassmannian formed by all k-dimensional subspaces of V . The corresponding Grassmann graph will be denoted by Γk(V ). We describe all isometric embeddings of Johnson graphs J (l,m), 1 < m < l − 1 in Γk(V ), 1 < k < n − 1 (Theorem 4). As a consequence, we get the following: the image of every isometric embedding of J (n, k...
متن کاملNote on Half-cube Embeddings
We establish some results on embeddings in half-cube graphs. They are motivated by M. Deza, M. Dutour Sikirić, and S. Shpectorov’s conjecture [1] concerning isometric embeddings of the skeletons of polytope Wythoffians in half-cube graphs.
متن کاملNeural Embeddings of Graphs in Hyperbolic Space
ABSTRACT Neural embeddings have been used with great success in Natural Language Processing (NLP). They provide compact representations that encapsulate word similarity and attain state-of-the-art performance in a range of linguistic tasks. The success of neural embeddings has prompted signi cant amounts of research into applications in domains other than language. One such domain is graph-stru...
متن کاملNeural Embeddings of Graphs in Hyperbolic Space
ABSTRACT Neural embeddings have been used with great success in Natural Language Processing (NLP). They provide compact representations that encapsulate word similarity and attain state-of-the-art performance in a range of linguistic tasks. The success of neural embeddings has prompted signi cant amounts of research into applications in domains other than language. One such domain is graph-stru...
متن کاملIsometric Embeddings of Half-Cube Graphs in Half-Spin Grassmannians
Let Π be a polar space of type Dn. Denote by Gδ(Π), δ ∈ {+,−} the associated half-spin Grassmannians and write Γδ(Π) for the corresponding half-spin Grassmann graphs. In the case when n ≥ 4 is even, the apartments of Gδ(Π) will be characterized as the images of isometric embeddings of the half-cube graph 1 2 Hn in Γδ(Π). As an application, we describe all isometric embeddings of Γδ(Π) in the ha...
متن کامل